Computer modeling of multidimensional problems of gravitational gas dynamics on multiprocessor computers
نویسندگان
چکیده
This article deals with a method, based on total variation diminishing (TVD) scheme, for solving three-dimensional equations of gravitational gas dynamics. For this method a parallel algorithm of the decision is offered. Equations of this kind are a powerful approach to simulating astrophysical problems. Numerical schemes applied for their solving must provide high-resolution capturing of shocks, prevent spurious oscillations and specify the behavior of the matter in the neighborhood of small perturbations beyond shock fronts. Difference schemes have to combine the properties of high resolution in the regions of small perturbations and of monotonicity in the domains of steep gradients in order to satisfy such contradictory conditions.
منابع مشابه
Analysis of effective factors on transient ground potential rise in gas insulated substations
This study presents the manner in which transient modeling concepts, which are fully analyzed in the referred standards, are implemented, for the purpose of evaluating the Transient Ground Potential Rise (TGPR). This is a phenomenon of 10–100kV voltages with up to 10μs duration on the grounded enclosure of Gas Insulated Substations (GIS), which may cause concern for personnel safety and problem...
متن کاملAnalysis of effective factors on transient ground potential rise in gas insulated substations
This study presents the manner in which transient modeling concepts, which are fully analyzed in the referred standards, are implemented, for the purpose of evaluating the Transient Ground Potential Rise (TGPR). This is a phenomenon of 10–100kV voltages with up to 10µs duration on the grounded enclosure of Gas Insulated Substations (GIS), which may cause concern for personnel safety and pro...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 17 شماره
صفحات -
تاریخ انتشار 2009